Characterizations of tree-like continua

Exactly two-to-one maps from continua onto some tree-like continua

It is known that no dendrite (Gottschalk 1947) and no hereditarily indecomposable tree-like continuum (J. Heath 1991) can be the image of a continuum under an exactly 2-to-1 (continuous) map. This paper enlarges the class of tree-like continua satisfying this property, namely to include those tree-like continua whose nondegenerate proper subcontinua are arcs. This includes all Knaster continua ...

The fixed point property for arc component preserving mappings of non-metric tree-like continua

The main purpose of this paper is to study the fixed point property of non-metric tree-like continua. Using the inverse systems method, it is proved that if X is a non-metric tree-like continuum and if f : X → X is a mapping which sends each arc component into itself, then f has the fixed point property.

Decidable Characterizations for Tree Logics

Detailed Scheduling of Tree-like Pipeline Networks with Multiple Refineries

In the oil supply chain, the refined petroleum products are transported by various transportation modes, such as rail, road, vessel and pipeline. The latter provides one of the safest and cheapest ways to connect production areas to local markets. This paper addresses the operational scheduling of a multi-product tree-like pipeline connecting several refineries to multiple distribution centers ...

Algebraic characterizations of trace and decorated trace equivalences over tree-like structures

Behavioural equivalences of labelled transition systems are characterized in terms of homomorphic transformations. This permits relying on algebraic techniques for proving systems properties and reduces equivalence checking of two systems to studying the relationships among the elements of their structures. Di6erent algebraic characterizations of bisimulation-based equivalences in terms of part...